A Parameterized Perspective on P2-Packings
نویسندگان
چکیده
We study (vertex-disjoint) P2-packings in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use extremal arguments for determining how many vertices of P appear in some P2-packing of size (j+1). We basically can ’reuse’ 2.5j vertices. We also present a kernelization algorithm that gives a kernel of size bounded by 7k. With these two results we build an algorithm which constructs a P2-packing of size k in time O (2.482).
منابع مشابه
A Parameterized Perspective on Packing Paths of Length Two
We study (vertex-disjoint) packings of paths of length two (i.e., of P2’s) in graphs under a parameterized perspective. Starting from a maximal P2-packing P of size j we use extremal combinatorial arguments for determining how many vertices of P appear in some P2-packing of size (j + 1) (if it exists). We prove that one can ’reuse’ 2.5j vertices. Based on a WIN-WIN approach, we build an algorit...
متن کاملDr. Martin Henk Combinatorial Optimization Finite and Innnite Packings at the Konrad-zuse-zentrum in Berlin. I Want to Thank Günter M. Ziegler and the Institute for Their Logistical and Technical Support. I Am Grateful to Finite and Infinite Packings
Preface In this thesis we give a new approach to the classical problems of finite and infinite packings and lattice packings of convex bodies. This approach is based on the introduction of parameterized densities δ ρ (K, C), ρ ∈ R >0. The parameterized density of a finite packing set C of a convex body K with respect to the parameter ρ is defined by δ ρ (K, C) = #(C)V (K) V (conv(C) + ρK) , whe...
متن کاملCFD Simulation of Dry and Wet Pressure Drops and Flow Pattern in Catalytic Structured Packings
Type of packings and characteristics of their geometry can affect the flow behavior in the reactive distillation columns. KATAPAK SP is one the newest modular catalytic structured packings (MCSP) that has been used in the reactive distillation columns, recently. However, there is not any study on the hydrodynamics of this packing by using computational fluid dynamics. In the present work, a 3D ...
متن کاملFixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract)
We study the complexity of a group of distance-constrained graph labeling problems when parameterized by the neighborhood diversity (nd), which is a natural graph parameter between vertex cover and clique width. Neighborhood diversity has been used to generalize and speed up FPT algorithms previously parameterized by vertex cover, as is also demonstrated by our paper. We show that the Uniform C...
متن کاملCombinatorically Prescribed Packings and Applications to Conformal and Quasiconformal Maps
The Andreev-Thurston Circle Packing Theorem is generalized to packings of convex bodies in planar simply connected domains. This turns out to be a useful tool for constructing conformal and quasiconformal mappings with interesting geometric properties. We attempt to illustrate this with a few results about uniformizations of finitely connected planar domains. For example, the following variatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0804.0570 شماره
صفحات -
تاریخ انتشار 2008